Constructions of generalized MSTD sets in higher dimensions
نویسندگان
چکیده
Let A be a set of finite integers, defineA+A={a1+a2:a1,a2∈A},A−A={a1−a2:a1,a2∈A}, and for non-negative integers s d definesA−dA=A+⋯+A︸s−A−⋯−A︸d. More Sums than Differences (MSTD) is an where |A+A|>|A−A|. It was initially thought that the percentage subsets [0,n] are MSTD would go to zero as n approaches infinity addition commutative subtraction not. However, in surprising 2006 result, Martin O'Bryant proved positive sets MSTD, although this extremely small, about 10−4 percent. This result extended by Iyer, Lazarev, Miller, Zhang [ILMZ] who showed generalized sets, {s1,d1}≠{s2,d2} s1+d1=s2+d2 with |s1A−d1A|>|s2A−d2A|, d-dimensions, MSTD. For many such results, establishing explicit 1-dimensions relies on specific choice elements left right fringes force certain differences missed while desired sums attained. In higher dimensions, geometry forces more careful assessment what have same behavior 1-dimensional fringe elements. We study d-dimensions use these create new constructions. prove existence k-generational which |cA+cA|>|cA−cA| all 1≤c≤k. then under conditions, there no |kA+kA|>|kA−kA| k∈N. video summary paper, please visit https://youtu.be/rojbhVqN90Q.
منابع مشابه
Fringe Pairs in Generalized Mstd Sets
A More Sums Than Differences (MSTD) set is a set A for which |A+A| > |A−A|. Martin and O’Bryant proved that the proportion of MSTD sets in {0, 1, . . . , n} is bounded below by a positive number as n goes to infinity. Iyer, Lazarev, Miller and Zhang introduced the notion of a generalized MSTD set, a set A for which |sA− dA| > |σA − δA| for a prescribed s + d = σ + δ. We offer efficient construc...
متن کاملExplicit Constructions of Infinite Families of Mstd Sets
We explicitly construct infinite families of MSTD (more sums than differences) sets, i.e., sets where |A+A| > |A−A|. There are enough of these sets to prove that there exists a constant C such that at least C/r of the 2 subsets of {1, . . . , r} are MSTD sets; thus our family is significantly denser than previous constructions (whose densities are at most f(r)/2 for some polynomial f(r)). We co...
متن کاملConstructions of generalized Sidon sets
We give explicit constructions of sets S with the property that for each integer k, there are at most g solutions to k = s1 + s2, si ∈ S; such sets are called Sidon sets if g = 2 and generalized Sidon sets (or B2[ ⌈ g/2 ⌉ ] sets) if g ≥ 3. We extend to generalized Sidon sets the Sidon-set constructions of Singer, Bose, and Ruzsa. We also further optimize Koulantzakis’ idea of interleaving sever...
متن کاملTwo Generalized Constructions of Relative Difference Sets
We give two generalizations of some known constructions of relative difference sets. The first one is a generalization of a construction of RDS by Chen, Ray-Chaudhuri and Xiang using the Galois ring GR(4,m). The second one generalizes a construction of RDS by Ma and Schmidt from the setting of chain rings to a setting of more general rings.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2022
ISSN: ['0022-314X', '1096-1658']
DOI: https://doi.org/10.1016/j.jnt.2021.03.029